Optimality of Spatially Inhomogeneous Search Strategies.
نویسندگان
چکیده
We consider random search processes alternating stochastically between diffusion and ballistic motion, in which the distribution function of ballistic motion directions varies from point to point in space. The specific space dependence of the directional distribution together with the switching rates between the two modes of motion establishes a spatially inhomogeneous search strategy. We show that the mean first passage times for several standard search problems-narrow escape, reaction partner finding, reaction escape-can be minimized with a directional distribution that is reminiscent of the spatial organization of the cytoskeleton filaments of cells with a centrosome: radial ballistic transport from the center to the periphery and back, and ballistic transport in random directions within a concentric shell of thickness Δ_{opt} along the domain boundary. The results suggest that living cells realize efficient search strategies for various intracellular transport problems economically through a spatial cytoskeleton organization that involves radial microtubules in the central region and only a narrow actin cortex rather than a cell body filled with randomly oriented actin filaments.
منابع مشابه
Optimal Control of Light Propagation Governed by Eikonal Equation within Inhomogeneous Media Using Computational Adjoint Approach
A mathematical model is presented in the present study to control the light propagation in an inhomogeneous media. The method is based on the identification of the optimal materials distribution in the media such that the trajectories of light rays follow the desired path. The problem is formulated as a distributed parameter identification problem and it is solved by a numerical met...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimization and universality of Brownian search in a basic model of quenched heterogeneous media.
The kinetics of a variety of transport-controlled processes can be reduced to the problem of determining the mean time needed to arrive at a given location for the first time, the so-called mean first-passage time (MFPT) problem. The occurrence of occasional large jumps or intermittent patterns combining various types of motion are known to outperform the standard random walk with respect to th...
متن کاملThe Tradeoff Between Speed and Optimality in Hierarchical Search
Abstraction works by replacing a state space, SS, by another, "abstract" space that is easier to search, SS′. There are two well-known strategies for employing the "abstract" solutions found in SS′ to guide search in the original space. The first uses the lengths of the abstract solutions as a heuristic for an A* search of SS. This always produces optimal solutions. The second strategy uses the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review letters
دوره 117 6 شماره
صفحات -
تاریخ انتشار 2016